Triple Key Security Algorithm Against Single Key Attack on Multiple Rounds
نویسندگان
چکیده
In cipher algorithms, the encryption and decryption are based on same key. There some limitations in for example polyalphabetic substitution key size must be equal to plaintext otherwise it will repeated if is known then becomes useless. This paper aims improve said by designing of Triple security algorithm (TKS) which modified maintain plaintext. Each character substituted an alternative message. The mode transformed cyclically depends current position communication. Three keys used process 8 or 16 rounds with Exclusively-OR (XOR) 1st study also identifies a single-key attack multiple block mobile communications applied proposed technique prevent attack. By utilization TKS algorithm, illustrated, analyzed detail mathematical examples.
منابع مشابه
A Differential Fault Attack Against Early Rounds of (Triple-)DES
Previously proposed differential fault analysis (DFA) techniques against iterated block ciphers mostly exploit computational errors in the last few rounds of the cipher to extract the secret key. In this paper we describe a DFA attack that exploits computational errors in early rounds of a Feistel cipher. The principle of the attack is to force collisions by inducing faults in intermediate resu...
متن کاملA Known Plaintext Attack on Two-Key Triple Encryption
A chosen-plaintext attack on two-key triple encryption noted by Merkle and Hellman is extended to a known-plaintext attack. The known-plaintext attack has lower memory requirements than the chosen-plaintext attack, but has a greater running time. The new attack is a significant improvement over a known-plaintext brute-force attack, but is still not seen as a serious threat to two-key triple enc...
متن کاملA related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock
متن کامل
Secure Message Authentication Against Related-Key Attack
Security against related-key attacks is an important criteria for modern cryptographic constructions. In the related-key setting, the adversary has the ability to query the underlying function on the target key as well as on some related-keys. Although provable security against related-key attack has received considerable attention in recent years, most of the results in the literature aim to a...
متن کاملMitigating Node Capture Attack in Random Key Distribution Schemes through Key Deletion
Random Key Distribution (RKD) schemes have been widely accepted to enable low-cost secure communications in Wireless Sensor Networks (WSNs). However, efficiency of secure link establishment comes with the risk of compromised communications between benign nodes by adversaries who physically capture sensor nodes. The challenge is to enhance resilience of WSN against node capture, while maintainin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers, materials & continua
سال: 2022
ISSN: ['1546-2218', '1546-2226']
DOI: https://doi.org/10.32604/cmc.2022.028272